Analysis of Surrogate-Assisted Information-Geometric Optimization Algorithms

نویسندگان

چکیده

Surrogate functions are often employed to reduce the number of objective function evaluations in a continuous optimization. However, their effects have seldom been investigated theoretically. This paper analyzes effect surrogate information-geometric optimization (IGO) framework, which includes as an algorithm instance variant covariance matrix adaptation evolution strategy—a widely used solver for black-box We derive sufficient condition on parameter update IGO algorithms point descent direction expected over search distribution. The is expressed terms three measures correlation between and function. Our result constitutes partial justification use algorithms.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards Surrogate Assisted Estimation of Distribution Algorithms

Estimation of distribution algorithms (EDAs) have become promising kinds of evolutionary algorithms. They are based on sampling an estimated distribution of the better of the solutions from the last generation – iteration of the algorithm. Learning the distribution and sampling is used instead of reproduction common in traditional evolutionary algorithms. In many real-world optimization tasks, ...

متن کامل

Eecient Algorithms for Geometric Optimization Eecient Algorithms for Geometric Optimization

Linear Programming 15 contain such a constraint), which implies that after kd iterations (H) (B) 2k. Hence, after kd successful rounds, 2k (H) nek=3. This implies that the above algorithm terminates in at most 3d lnn successful rounds. Since each round takes O(dd) time to compute xR and O(dn) time to compute V , the expected running time of the algorithm is O((d2n+dd+1) log n). By combining thi...

متن کامل

Information-Geometric Optimization Algorithms: A Unifying Picture via Invariance Principles

We present a canonical way to turn any smooth parametric family of probability distributions on an arbitrary search space X into a continuous-time black-box optimization method onX , the informationgeometric optimization (IGO) method. Invariance as a major design principle keeps the number of arbitrary choices to a minimum. The resulting IGO flow is the flow of an ordinary differential equation...

متن کامل

Eecient Algorithms for Geometric Optimization

Linear Programming 15 after kd successful rounds, 2k (H) nek=3. This implies that the above algorithm terminates in at most 3d lnn successful rounds. Since each round takes O(dd) time to compute xR and O(dn) time to compute V , the expected running time of the algorithm is O((d2n+dd+1) log n). By combining this algorithm with a randomized recursive algorithm, Clarkson improved the expected runn...

متن کامل

Geometric Optimization Algorithms in Manufacturing

In this paper we review the recent progress in the design of efficient algorithms for several geometric optimization problems in manufacturing processes. We first describe the strong geometric characteristics of optimization problems in manufacturing. Three illustrative problems are then presented in details: the shortest contour touring problem in laminated object manufacturing, the minimum to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algorithmica

سال: 2022

ISSN: ['1432-0541', '0178-4617']

DOI: https://doi.org/10.1007/s00453-022-01087-8